Zero-temperature Glauber dynamics on small-world networks
نویسندگان
چکیده
منابع مشابه
Zero temperature Glauber dynamics on complex networks
We study the Glauber dynamics at zero temperature of spins placed on the vertices of an uncorrelated network with a power law degree distribution. Application of mean-field theory yields as the main prediction that for symmetric disordered initial conditions the mean time for reaching full order is finite or diverges as a logarithm of the system size N , depending on the exponent of the degree ...
متن کاملEvolutionary Dynamics on Small-World Networks
We study how the outcome of evolutionary dynamics on graphs depends on a randomness on the graph structure. We gradually change the underlying graph from completely regular (e.g. a square lattice) to completely random. We find that the fixation probability increases as the randomness increases; nevertheless, the increase is not significant and thus the fixation probability could be estimated by...
متن کاملInfection Dynamics on Small-World Networks
The use of network models to describe the impact of local spatial structure on the spread of infections is discussed. In particular, we focus on small-world networks, within which the pattern of interactions can be varied from being entirely local to being entirely global as a single parameter is changed. Analysis approaches from graph theory, statistical physics and mathematical epidemiology a...
متن کاملSurfaces of Constant Temperature for Glauber Dynamics
The wavefunction of a single spin system in a prepared initial state evolves to equilibrium with a heat bath. The average spin q(t) = p↑(t)− p↓(t) exhibits a characteristic time for this evolution. With the proper choice of spin flip rates, a dynamical Ising model (Glauber) can be constructed with the same characteristic time for transition of the average spin to equilibrium. The Glauber dynami...
متن کاملAdaptive Dynamics of Realistic Small-World Networks
Continuing in the steps of Jon Kleinberg’s and others celebrated work on decentralized search in small-world networks, we conduct an experimental analysis of a dynamic algorithm that produces small-world networks. We find that the algorithm adapts robustly to a wide variety of situations in realistic geographic networks with synthetic test data and with real world data, even when vertices are u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical
سال: 2009
ISSN: 1751-8113,1751-8121
DOI: 10.1088/1751-8113/42/41/415102